Experiments in social computation

Experiments with PageRank Computation

PageRank algorithm is one of the most commonly used algorithms that determine the global importance of web pages. Due to the size of web graph which contains billions of nodes, computing a PageRank vector is very computational intensive and it may takes any time between months to hours depending on the efficiency of the algorithm. This promoted many researchers to propose techniques to enhance ...

Experiments in Mobile Social Networking

In this report we consider a mobile ad hoc network setting where users of Bluetooth enabled devices meet and communicate opportunistically as when random people meet in a cafe, or researchers meet at a conference. Ad hoc opportunistic contacts are built on the basis of pre-defined relationships in online social networks. Our approach distinguishes itself from previous work in the area by three ...

Replication Issues in Social Experiments

Social Psychology Experiments

Evolutionary Computation with Extinction: Experiments and Analysis

Under a species-level abstraction of classical evolutionary programming, the standard tournament selection model is not appropriate. When viewed in this manner, it is more appropriate to consider two modes of life histories: background evolution and extinction. The utility of this approach as an optimization procedure is evaluated on a series of test functions relative to the performance of cla...